Interrupted EDF Scheduling
نویسنده
چکیده
In this paper we extend the results for the mixed scheduling algorithm of Liu and Layland in [3]. It is the seminal paper for the basic real-time scheduling algorithms: Rate Monotonic Scheduling (RMS) and Earliest Deadline First (EDF) Scheduling, and for their corresponding schedulability tests [1,2,4,5,7]. In a final section of the paper the authors also investigate the mixed scheduling algorithm which is a combination of both EDF and RMS. Their motivation for looking at this combined algorithm is the observation that conventional interrupt hardware behaves in a fixed priority manner and does not appear compatible with a hardware EDF scheduler. On the other hand the overhead in implementing EDF in software for the slower paced tasks would not be great.
منابع مشابه
Performance Analysis of Dynamic Priority Scheduling Algorithms in Real Time Systems
A scheduling algorithm is the one which decides a schedule for a given set of tasks. There are a number of algorithms for task scheduling on a processor. Some of these algorithms are used for scheduling tasks on a multiprocessor system either under the partitioning scheme or under the global scheme. The optimal algorithm is the Earliest Deadline First (EDF) algorithm. If a set of task cannot be...
متن کاملA Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101
This paper compares the performance of several variations on EDF-based global and partitioned multiprocessor scheduling algorithms, together with their associated feasibility tests, on a variety of pseudo-randomly chosen sets of sporadic tasks. A new hybrid EDF-based scheme is shown to perform better than previously studied priority-based global scheduling schemes, though not as well as EDF-bas...
متن کاملA Comparison of Global EDF and LLREF Scheduling Algorithms
In this paper we are going to analyze and trying to compare EDF and LLREF scheduling algorithms, used in multiprocessor platforms. We will briefly describe classic EDF, global EDF, which is an extension of EDF, and the newer LLREF algorithm. Then we will analyze the ability of global EDF in scheduling task sets in random manner and compare with the LLREF one, which can schedule any task set whe...
متن کاملComparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor
Multiprocessor architecture becomes common on realtime systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these algorithms are necessary. In this paper, we compare EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, ...
متن کاملMultimedia Real-Time Disk Scheduling by Hybrid Local/Global Seek-Optimizing Approaches
Real-time disk scheduling is one of the most important problems in designing a multimedia system. It has been proved to be NP-Complete. In these years, various approaches are proposed to improve disk throughput under guaranteed real-time requirements. SCAN-EDF, which utilizes SCAN to reschedule tasks in a real-time EDF schedule, is one of the best-known real-time disk scheduling methods. Since ...
متن کامل